Team:OURAGAN

Team Ouragan

Team, Visitors, External Collaborators

Overall Objectives

Overall Objectives
Scientific ground

Research Program

Basic computable objects and algorithms
Algorithmic Number Theory
Topology in small dimension

Application Domains

Security of cryptographic systems
Robotics
Control theory

Highlights of the Year

New Software and Platforms

ISOTOP
RS
A NewDsc
SIROPA
MPFI

New Results

On SL(3,ℂ)-representations of the Whitehead link group
A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
Computing Chebyshev knot diagrams
Programmable projective measurement with linear optics
Updating key size estimations for pairings
How to Securely Compute with Noisy Leakage in Quasilinear Complexity
A New Public-Key Cryptosystem via Mersenne Numbers
Workspace, Joint space and Singularities of a family of Delta-Like Robot
Certified Non-conservative Tests for the Structural Stability of Discrete Multidimensional Systems

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry

Partnerships and Cooperations

European Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Major publications
Publications of the year
References in notes

Inria | Raweb 2018 | Presentation of the Team OURAGAN | OURAGAN Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

Updating key size estimations for pairings

Recent progress on NFS imposed a new estimation of the security of pairings. In [6], we study the best attacks against some of the most popular pairings. It allows us to propose new pairing-friendly curves of 128 bits and 192 bits of security.

Previous |

Home | Next next